Proper Forcing and L(r)

نویسندگان

  • Itay Neeman
  • Jindřich Zapletal
چکیده

We present two ways in which the model L(R) is canonical assuming the existence of large cardinals. We show that the theory of this model, with ordinal parameters, cannot be changed by small forcing; we show further that a set of ordinals in V cannot be added to L(R) by small forcing. The large cardinal needed corresponds to the consistency strength of ADL(R); roughly ω Woodin cardinals.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Proper forcing extensions and Solovay models

We study the preservation of the property of L(R) being a Solovay model under proper projective forcing extensions. We show that every ∼ 1 3 strongly-proper forcing notion preserves this property. This yields that the consistency strength of the absoluteness of L(R) under ∼ 1 3 strongly-proper forcing notions is that of the existence of an inaccessible cardinal. Further, the absoluteness of L(R...

متن کامل

Semi-proper forcing, remarkable cardinals, and Bounded Martin's Maximum

We show that L(R) absoluteness for semi-proper forcings is equiconsistent with the existence of a remarkable cardinal, and hence by [6] with L(R) absoluteness for proper forcings. By [7], L(R) absoluteness for stationary set preserving forcings gives an inner model with a strong cardinal. By [3], the Bounded Semi-Proper Forcing Axiom (BSPFA) is equiconsistent with the Bounded Proper Forcing Axi...

متن کامل

Proper Forcing and Remarkable Cardinals II

The current paper proves the results announced in [6]. We isolate a new large cardinal concept, “remarkability.” Consistencywise, remarkable cardinals are between ineffable and ω-Erdös cardinals. They are characterized by the existence of “0-like” embeddings; however, they relativize down to L. It turns out that the existence of a remarkable cardinal is equiconsistent with L(R) absoluteness for...

متن کامل

Global Forcing Number for Maximal Matchings under Graph Operations

Let $S= \{e_1,\,e_2‎, ‎\ldots,\,e_m\}$ be an ordered subset of edges of a connected graph $G$‎. ‎The edge $S$-representation of an edge set $M\subseteq E(G)$ with respect to $S$ is the‎ ‎vector $r_e(M|S) = (d_1,\,d_2,\ldots,\,d_m)$‎, ‎where $d_i=1$ if $e_i\in M$ and $d_i=0$‎ ‎otherwise‎, ‎for each $i\in\{1,\ldots‎ , ‎k\}$‎. ‎We say $S$ is a global forcing set for maximal matchings of $G$‎ ‎if $...

متن کامل

Complete forcing numbers of polyphenyl systems

The idea of “forcing” has long been used in many research fields, such as colorings, orientations, geodetics and dominating sets in graph theory, as well as Latin squares, block designs and Steiner systems in combinatorics (see [1] and the references therein). Recently, the forcing on perfect matchings has been attracting more researchers attention. A forcing set of M is a subset of M contained...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008